Information processing method, information processing apparatus, and recording medium

ABSTRACT

The robustness of discriminating results at each stage is improved in discrimination processing in which a plurality of stages of discriminators are used to identify an object. An information processing apparatus in which a plurality of stages of the discriminators are used to identify a class of an object, comprises a candidate class output unit that acquires as a candidate class a class discriminated at a first stage of the discriminators, and an extended class setting unit that sets in a second stage of the discriminators, a class of a second stage of the discriminators, which is defined as an extended partial space of a partial space defined by a candidate class in a discriminating space used in discriminating the candidate class by the first stage of the discriminators, as a class to be discriminated at this second stage of the discriminators.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to information processing technology thatcan be applied to recognition processing in which an object isrecognized from an image obtained by capturing said object.

2. Description of the Related Art

Conventionally there has been active research into recognition methodsin which a computer learns characteristic quantities extracted fromimages obtained by capturing various objects, and the type of objectsincluded in a newly input image is recognized.

There has also been research into using model information and so forthabout an object to recognize not only the type of object, but also itsposition and orientation.

For example, in “Robust Object Detection with Interleaved Categorizationand Segmentation” (IJCV Special Issue on Learning for Vision forLearning, August 2007) by B. Leibe, there is proposed a method in whichcharacteristic points extracted from a learning image and made into acodebook are associated with characteristic points extracted from aninputted image, and the center position of an object is identified byprobabilistic voting (implicit-shape-model). With this method, it ispossible to identify not only the type of object, but also the positionand orientation of the object.

Also, with the method disclosed in Japanese Patent Laid-Open No.2008-257649, first a characteristic quantity is calculated for eachcharacteristic point extracted from an input image, these are contrastedwith the characteristic quantities of characteristic points calculatedfor a learning image, and similar characteristic points are set ascorresponding points. Then, reference points are calculated for thecharacteristic points of the input image by using the vector from thecharacteristic points to the reference points calculated ahead of timewith learning images having mutually different types, positions, andorientations. Then, the positions of the calculated reference points arevoted on a specific image plane, and it is decided whether or not atleast a specific number of the calculated reference points are presentwithin a small region in a specific image plane. If they are present,then a learning image having vectors used in the calculation of thesereference points is determined to be a learning image that is similar tothe input image, and this identifies the type, position, and orientationof the object.

However, if the user tries to identify not only the type of the object,but also its position or orientation, a problem encountered with theabove recognition method was that recognition was difficult when theinput image was small or when there were few characteristic points thatwere effective for the recognition of position or orientation. Becauseof this, when there are a plurality of recognition categories (type,position, orientation, etc.), a recognition technique is generally usedin which a plurality of stages of discriminators are used to graduallynarrow down the candidates, and research has also been underway intorecognition technology such as this.

A coarse-to-fine method is an example of such recognition technology.With a coarse-to-fine method, a class identified by the first stage ofdiscriminators is set coarser than a class that is ultimatelyidentified. More specifically, in the discrimination of the type of anobject, the first stage of discriminators performs discriminationprocessing upon combining a plurality of type classes into a singleclass. Similarly, in the discrimination of the orientation of an object,the first stage of discriminators performs discrimination processingupon combining a plurality of orientation classes into a single class.That is, whatever the discrimination category may be (type,orientation), the first stage of discriminators narrows down thecandidate class through coarse setting of the class, and the second andsubsequent stages of discriminators are used to further narrow down theclass from among this candidate class, and thereby identifies the finalclass.

As an example of a coarse-to-fine method, Japanese Patent 3,925,011proposes a method in which pattern recognition is performed by using aplurality of stages of discriminators to gradually narrow down thecandidate class at each stage. In the case of Japanese Patent 3,925,011,a reference pattern to be used in narrowing down the stages is decidedahead of time for every discrimination category, and these referencepatterns are used to perform learning processing and produce adictionary. The various classes here are set so that there are morereference patterns in higher-numbered stages. A candidate class isdetected for an discrimination object during discrimination processingat each stage, and the candidate class closest to the discriminationobject is narrowed down by using a dictionary configured to become moredetailed in stages. After this, if the result of discriminationprocessing at each stage up to the K-th stage is the same candidateclass, then that candidate class is output as the discrimination result.

Furthermore, in the case of Japanese Patent 3,447,717 an entire learningtemplate is used to perform a rotation coarse search and narrow down thesearch range in template matching. Also, the orientation of an object isultimately identified by using a partial template of a preset learningtemplate. In Japanese Patent 3,447,717, there are a plurality of partialtemplates, and a characteristic portion of the object is specified ineach of the partial templates. A partial template is subjected totemplate matching within a narrowed search range, and the finalorientation is identified on the basis of the positional relation of thepartial templates.

However, when any coarse-to-fine method is used, as the number of stagesof discriminators increases, minute differences require the matching oftemplates and a decision about class, etc, so a problem is thatdiscrimination becomes more difficult. Because of this, when a pluralityof stages of discriminators are used to perform recognition processingon an object, it is necessary to raise the robustness for a candidateclass that is narrowed down as the stage number of discriminatorsincreases, so that there will be no drop in recognition accuracy.

SUMMARY OF THE INVENTION

The present invention was conceived in light of the above problem.

To achieve the stated object, the information processing apparatusaccording to the present invention comprises the following constitution.Specifically, it is an information processing apparatus capable ofexecuting discrimination processing to identify a class of an object byusing a plurality of stages of discriminators, comprising: anacquisition unit that acquires as a candidate class a class identifiedat a first stage of discriminators; and a setting unit that sets a classof a second stage of discriminators, in which a partial space defined bythe candidate class is defined as an extended partial space in adiscriminating space used in identifying the candidate class by thefirst stage of discriminators, as a class to be identified at thissecond stage of discriminators.

With the present invention, it is possible to increase the robustness ofdiscrimination results at each stage in discrimination processing toidentify an object by using a plurality of stages of discriminators.

Further features of the present invention will become apparent from thefollowing description of exemplary embodiments (with reference to theattached drawings).

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and constitute apart of the specification, illustrate embodiments of the invention and,together with the description, serve to explain the principles of theinvention.

FIG. 1 is a diagram of the external configuration of an identificationprocessing system 100 comprising an information processing apparatus120.

FIG. 2 is a diagram illustrating the functional configuration of theinformation processing apparatus 120.

FIG. 3 is a flowchart showing the flow of discrimination processingperformed on an object 130 by the information processing apparatus 120.

FIG. 4 is a diagram illustrating a learning image.

FIG. 5 shows a plurality of learning images from different viewpoints.

FIG. 6 is a flowchart showing the flow of learning processing.

FIG. 7 is a diagram illustrating vector calculation processing.

FIG. 8 is a flowchart showing the flow of candidate class outputprocessing.

FIG. 9 shows an example of a voting space.

FIG. 10 is a diagram illustrating extension class setting processing.

FIG. 11 is a diagram illustrating extension class setting processing.

FIG. 12 is a diagram illustrating extension class setting processing.

FIG. 13 is a diagram illustrating the concept behind extension classsetting processing.

FIG. 14 is a diagram illustrating the concept behind extension classsetting processing.

FIG. 15 is a diagram illustrating the functional configuration of aninformation processing apparatus 1500.

FIG. 16 is a flowchart showing the flow of discrimination processingperformed on the object 130 by the information processing apparatus1500.

FIG. 17 shows an example of a characteristic point when the object is anindividual's face.

FIG. 18 shows an example of a candidate class output by execution of acandidate class output step.

FIG. 19 is a diagram illustrating the functional configuration of aninformation processing apparatus 1900.

FIG. 20 is a flowchart showing the flow of discrimination processingperformed on the object 130 by the information processing apparatus1900.

DESCRIPTION OF THE EMBODIMENTS

Embodiments of the present invention will now be described in detail inaccordance with the accompanying drawings.

Of the embodiments described in detail below, in a first embodiment, acandidate class output by a first stage of discriminators when thisfirst stage of discriminators executes discrimination processing isextended in a discriminating space used in the execution of thisdiscrimination processing. This extended candidate class (extendedclass) is subjected to discrimination processing by a second stage ofdiscriminators, which increases the robustness of the discriminationprocessing at the second stage of discriminators (the stability ofdiscrimination processing with respect to the effect of disturbance,such as a change in environment).

In a second embodiment, the candidate class output by the first stage ofdiscriminators is marginalized by the execution of discriminationprocessing by a first stage of discriminators. The term marginalizationhere means finding the probability (“marginal probability”) expressed bydeleting the probability variable of a specific characteristic out ofthe probability variables expressing the existence probability of eachof a plurality of characteristics utilized in identifying candidateclasses. The robustness of discrimination processing at a second stageof discriminators is improved by having the second stage ofdiscriminators execute discrimination processing in which this marginalprobability is used.

In a third embodiment, the candidate class output by executingdiscrimination processing with a first stage of discriminators is set ina second stage of discriminators. In executing the discriminationprocessing of this candidate class at the second stage ofdiscriminators, a plurality of classes and a characteristic point thatis valid for the discrimination category to be identified by the secondstage of discriminators (such as the orientation of an object), which isdefined ahead of time for each candidate class, are set. Consequently,in the discrimination of a candidate class at the second stage ofdiscriminators, discrimination results for the characteristic points ofa plurality of classes newly set for the candidate classes can bedetermined all together, and the robustness of discrimination processingat the second stage of discriminators can be improved.

The present invention is applied to discrimination processing in which aplurality of stages of discriminators are used to identify an object,and the discrimination processing executed by the discriminators is notitself limited to any particular method. However, in the embodimentsthat follow, for the sake of convenience a case will be described inwhich an discriminators that executes discrimination processing bycalculating a reference point and voting in a specific image plane isused as the first stage of discriminators.

Also, the discrimination processing to which the present invention canbe applied includes a variety of discrimination categories, such as thetype and orientation of the object, but of the embodiments that follow,in the first and third embodiments a case will be described in which thediscrimination categories are the type and orientation of an object. Inthe second embodiment, a case will be described in which thediscrimination category is just the type of an object.

First Embodiment 1. External Configuration of Identification ProcessingSystem

The external configuration of an identification processing systemcomprising the information processing apparatus according to thisembodiment will first be described. FIG. 1 is a diagram of the externalconfiguration of an identification processing system 100 comprising aninformation processing apparatus 120 according to this embodiment. InFIG. 1, 110 is an imaging unit (such as a camera), which captures animage of an object 130. 120 is an information processing apparatus,which identifies the type and orientation of the object 130 on the basisof an image (input image) obtained by capturing an image of the object130 with the imaging unit 110.

2. Functional Configuration of Information Processing Apparatus

Next, the functional configuration of the information processingapparatus 120 will be described. FIG. 2 is a diagram illustrating thefunctional configuration of the information processing apparatus 120. Asshown in FIG. 2, the information processing apparatus 120 comprises acandidate class output unit 210, an extended class setting unit 220, aclass identifier 230, an discriminator learning-use data holder 240, afirst discriminator holder 250, and a second discriminator holder 260.

In this embodiment, the discriminator learning-use data holder 240, thefirst discriminator holder 250, and the second discriminator holder 260are described as being disposed inside the information processingapparatus 120, but the present invention is not necessarily limited tothis. For instance, they may be disposed outside the informationprocessing apparatus 120, in a nonvolatile memory apparatus connectedexecutably by the information processing apparatus 120.

3. Summary of Discrimination Processing by Information ProcessingApparatus

Next, the discrimination processing performed on the object 130 by theinformation processing apparatus 120 will be described. FIG. 3 is aflowchart showing the flow of discrimination processing performed on theobject 130 by the information processing apparatus 120.

When discrimination processing is begun, in step S301, the candidateclass output unit 210 executes a candidate class output step. Morespecifically, the candidate class output unit 210 causes a first stageof discriminators (first discriminator) held in the first discriminatorholder 250 to execute discrimination processing on an input imageobtained by capturing an image of the object 130, and thereby acquires aplurality of candidate classes from this first discriminator. Theplurality of acquired candidate classes are sent to the extended classsetting unit 220. The term “class” here refers to the range (partialspace) over which a given classification label is assigned in adiscriminating space. That is, when the object 130 is identified by thefirst discriminator as belonging to a certain range, that object 130 isidentified as being a class defined by that range. A class defined byperforming learning processing by using a learning image stored ahead oftime in the discriminator learning-use data holder 240 (the class forthe type and orientation of the object) is set in the firstdiscriminator.

In step S302, the extended class setting unit 220 executes an extendedclass setting step. More specifically, the discrimination robustness isimproved for at least one of the plurality of candidate classes outputfrom the candidate class output unit 210 in the candidate class outputstep (step S301). More specifically, the range in the discriminatingspace of the first discriminator defined by this candidate class isextended. The class defined by the extended range is then sent as anextended class to the class identifier 230. The extended class will bediscussed in detail below.

In step S303, the class identifier 230 executes a class discriminationstep. More specifically, a second stage of discriminators (seconddiscriminator) held in the second discriminator holder 260 is used toidentify the extended class set in the extended class setting step (stepS302) to which the object 130 in an input image belongs.

Thus, in the class discrimination step (step S303), the seconddiscriminator executes discrimination processing on an extended classthat includes the candidate class output in the candidate class outputstep and the class that was newly included in the extended class settingstep. We shall assume that the defined class is set by performinglearning processing using a learning image stored ahead of time in thediscriminator learning-use data holder 240.

Thus, in this embodiment, the robustness of discrimination processing inthe second discriminator is improved by increasing the candidate classesin executing discrimination processing at the second discriminator.

The above-mentioned processing performed by the information processingapparatus 120 will now be described in detail.

4. Details of Processing Performed by Information Processing Apparatus4.1 Details of Learning Processing

First, we will describe a learning image, and learning processing usedto calculate the following information set in the first discriminator onthe basis of this learning image.

-   -   Characteristic quantity of characteristic points    -   Class of learning image    -   Vector from each characteristic point to reference point    -   Representative vector used in associating with characteristic        point of input image    -   Characteristic points included in each cluster

i) Learning Image

First, we will describe the learning image used in learning processing.FIG. 4 is a diagram illustrating a learning image. As shown in FIG. 4,an image obtained by capturing the object 130 from perspectives 401 of ageodesic dome 400 that surrounds the object 130 is utilized as alearning image. FIG. 5 shows learning images obtained by capturing theobject 130 at two of the plurality of viewpoints 401. FIG. 5 is just anexample of a learning image, and we will assume that in performinglearning processing, learning images of the object 130 are acquired in anumber at least equivalent to the number of perspectives in the geodesicdome 400 shown in FIG. 4.

ii) Flow of Learning Processing

Learning processing will now be described. FIG. 6 is a flowchart showingthe flow of learning processing for calculating the above-mentionedinformation used in executing discrimination processing based on areference point, which is executed by the first discriminator.

In step S601, characteristic points f_(i) are extracted from thelearning images and stored. The characteristic quantities F_(i) (i=1, 2,. . . , N) of the characteristic points f_(i) in the learning images,and the class of the learning images (the type and orientation of theobject 130) are stored. We shall let ID_(i) be an index indicating theclass of each learning image (i=1, 2, . . . , N). We shall also letID_(i) be a value from 1 to P (where P is the total number of classes).

Then, in step S602, the vector from the characteristic points f_(i) tothe reference point O_(j) is calculated. The vector calculationprocessing shown in step S602 will now be described in specific termsthrough reference to FIG. 7.

FIG. 7 is a diagram schematically illustrating the relation between thereference point and some of the characteristic points extracted from thelearning image belonging to a certain class. In FIG. 7, 701 is a part ofthe object 130, 702 is a characteristic point, 703 is the vector from acertain characteristic point to the reference point, and 704 is thereference point. There are seven characteristic points in FIG. 7, andreference number 702 indicates one of these characteristic points.

In processing to calculate the vector to the reference point, a vectorM_(n)=(x_(o)−x_(n), y_(o)−y_(n)) from the position f_(n)=(x_(n), y_(n))of the characteristic point 702 of the part 701 of the object to thereference point O=(x_(o), y_(o)) set for the part 701 of the object(here, the center of the object) is calculated.

The vector M_(ij) (i=1, 2, . . . , N, j=1, 2, 3, . . . ) from eachcharacteristic point f_(i) to the reference point O_(j) is calculatedfor the entire learning image, after which the flow proceeds to stepS603.

In step S603, clustering is performed according to the characteristicquantities F_(i) (i=1, 2, . . . , N_(all)) for all of the obtainedcharacteristic points f_(i) (i=1, 2, . . . , N_(all)). Here, N_(all)indicates the number of characteristic points extracted from the entirelearning image. The clustering method may be k-means, or any otherclustering method may be used, such as using a self-organizing mapalgorithm. For example, with k-means, clustering can be accomplished byusing the Euclidean distance between the characteristic quantitiesF_(i), with the number of clusters K specified.

In step S604, clustering information is stored. More specifically, therepresentative vectors F_(k)′ (k=1, 2, . . . , K) (K is the number ofclusters and k is an index) of the clusters, and the characteristicpoints included in these clusters, are stored. The representativevectors F_(k) and characteristic points are utilized in associating thecharacteristic points extracted from the input image with thecharacteristic points of the learning image. The above processing endsthe learning processing.

In the above description, k-means was given as an example of aclustering method for clustering the characteristic points extractedfrom the entire learning image according to the characteristicquantities, but the present invention is not limited to or by this. Forexample, a random forest method, which is an ensemble learning method(see U.S. Pat. No. 6,009,199, for example), may be used. In the randomforest method, pattern recognition is performed using a plurality ofdecision trees.

With a random forest method, information is randomly requested at eachnode, the learning pattern is split up again and again according to therequest result, and the decision tree is steadily branched. A learningpattern that remains upon arriving at a leaf node is stored as aclassification result of that leaf node. In this embodiment, thelearning pattern is classified as characteristic points of each learningimage.

4.2 Candidate Class Output Processing at Candidate Class Output Unit

The candidate class output processing performed by the candidate classoutput unit 210 will now be described. FIG. 8 is a flowchart showing theflow of candidate class output processing.

In step S801, just as in learning processing, characteristic points areextracted from an input image obtained by capturing an object. In stepS802, the cluster with the highest similarity is decided by calculatingthe distance between the representative vector for each cluster and thecharacteristic quantities of the extracted characteristic points.Consequently, it is possible to associate the characteristic pointsextracted from the input image with the characteristic points of thelearning image. When a random forest method is used, leaf nodes aredetermined by classifying the characteristic points extracted from theinput image. The same applies when another classification tree is used.

In step S803, the vector to the reference point is read, which is storedadded to the characteristic points in the cluster to which therepresentative vectors found by association belong. The vector thus readout is used to calculate the reference point for each of thecharacteristic points extracted from the input image, and voting isperformed in a voting space. In this embodiment, the voting space is aspace formed by three axes: the x and y axes of the image coordinates,and the axis expressing the class ID.

FIG. 9 shows an example of a voting space formed by the x and y axes ofthe image coordinates and the axis expressing the class ID. In FIG. 9,900 is the voting space. We will assume that the size of each cell inthe voting space 900 has already been set as shown in FIG. 9.

The specific voting method here will be described through reference tothe voting space 900 shown in FIG. 9. The cluster k″ with the highestsimilarity is determined by comparing the characteristic quantity G_(m)of each of the characteristic points g_(m)=(x_(m), y_(m)) (m=1, 2, . . ., M) (M is the total number of characteristic points extracted from theinput image, and m is an index indicating the characteristic points)extracted from the input image, with the representative vector F_(k)′(k=1, 2, . . . , K) of each cluster obtained by learning processing.

For example, the following Formula 1 is used when calculating from theEuclidean distance between the representative vector F_(k)′ (k=1, 2, . .. , K) of each cluster and the characteristic quantity G_(m) of each ofthe extracted characteristic points g_(m).

$\begin{matrix}{k^{''} = {\underset{k}{\arg \; \min}{{g_{m} - F_{k}^{\prime}}}}} & \left\lbrack {{Formula}\mspace{14mu} 1} \right\rbrack\end{matrix}$

Voting processing is performed according to the class ID_(i) (i=1, 2, .. . , N) and the vector M_(ij) (i=1, 2, . . . , N, j=1, 2, 3, . . . ) tothe reference points stored added to the characteristic points f_(i)included in the determined cluster. More specifically, if we let thevoting points in the voting space 900 be (x, y, ID), then the votingpoints are calculated from the following Formula 2.

(x,y)=(x _(m) ,y _(m))+M _(ij)

ID=ID _(i)  [Formula 2]

Actually, a vote is added to a cell corresponding to the (x, y, ID) thatwas found. The processing here is performed on all the characteristicpoints in the cluster determined to have the highest similarity for thecharacteristic points extracted from the input image. The total numberof votes in this case is a maximum N×M.

In step S804, the cell with the maximum number of votes in the votingspace 900 that underwent voting in step S803 is extracted.Alternatively, the cell with the most votes over a specific number(number of candidates) or the cell that is over a predeterminedthreshold may be extracted. Here, we will assume that the number ofcandidates is P (P≦1), and each candidate class is (x_(p), y_(p),ID_(p)).

4.3 Extended Class Setting Processing Performed by Extended ClassSetting Unit

The extended class setting processing performed by the extended classsetting unit 220 will now be described through reference to FIGS. 10 to12. In extended class setting processing, the extended class is set inthe discriminating space for which the candidate class has been set,with respect to the candidate classes (x_(p), y_(p), ID_(p)) (p=1, 2, .. . , P) output in candidate class output processing.

As shown in FIG. 10, the orientation of the object 130 is set in threedegrees of freedom, in which the rotational angle with respect to thecoordinate axes (X, Y, and Z axes) in the world coordinate system is thecharacteristic quantity. In FIG. 10, 1001 is the Z axis of the object130, and the object 130 is shown rotated by a rotational angle 1002around the Z axis 1001. 1003 shows the rotational direction of theobject 130 around the Y axis.

In discrimination processing at the first discriminator, we will assumethat of the six degrees of freedom of the discriminating space, it iseasy to estimate a characteristic quantity expressing the rotationalangle around the X and Y axes other than the rotational angle 1002around the Z axis 1001. In this embodiment, since orientation is treatedas a class, of the three characteristic quantities, the class(orientation) closer to the two characteristic quantities other than therotational angle 1002 with respect to the Z axis 1001 shall be assumedto be learned during learning processing.

FIG. 11 shows an example of the class (orientation) closer to thecharacteristic quantities for the rotational angles of the tworotational axes other than the rotational angle 1002 with respect to theZ axis 1001 of the object 130.

FIG. 12 is a diagram of classes 12 a and 12 c rotated in the rotationaldirection 1003 with respect to the candidate class shown by 12 b. 12 aand 12 c both have the same rotational angle 1002 with respect to the Zaxis 1001. These classes are combined, and the resulting class shall betermed an extended class.

That is, since the extended class includes a plurality of candidateclasses, when the second discriminator identifies whether or not a classbelongs to this extended class, robustness is improved in discriminationprocessing by the second discriminator.

The concept behind the extended class setting processing performed bythe extended class setting unit 220 will now be described using adiscriminating space. In extended class setting processing, the rangedefined as the discriminating space of a candidate class is extended inorder to improve robustness between at least one set of candidateclasses out of the candidate classes identified by the firstdiscriminator.

13 a and 13 b in FIG. 13 are diagrams in which a discriminating space isused to express the concept behind extended class setting processing. In13 a and 13 b of FIG. 13, 1300 is the entire discriminating space. 1302is a partial discriminating space obtained by segmenting thediscriminating space 1300.

Discriminating the class of an object corresponds to deciding, in thediscriminating space 1300, the partial discriminating space 1302 towhich the object 130 belongs. In this embodiment, the class of theobject 130 is decided by using a first stage of discriminators and asecond stage of discriminators, but there may be three or more stages ofdiscriminators.

In 13 a in FIG. 13, 1301 is the class output as a candidate class forthe object 130 by the first discriminator. 13 b in FIG. 13 shows thesituation when the candidate classes of 13 a in FIG. 13 are extended soas to improve the robustness between candidate classes, and 1303 is anextended class obtained by extending the candidate classes.

Thus setting the extended class allows not only the candidate classesidentified by the first discriminator, but also classes around thecandidate classes (classes adjacent to candidate classes in thediscriminating space) to be utilized in discriminating the class of theobject 130 with the second discriminator.

We shall assume that the extended class has been preset. Also, it may beset for each candidate class individually, and as shown in 14 a and 14 bof FIG. 14, different extended classes may be set for the candidateclasses 1301 (see 1403).

4.4 Class Discrimination Processing Performed by Class Identifier

The class discrimination processing performed by the class discriminator230 will now be described. In class discrimination processing, thesecond discriminator held in the second discriminator holder 260 is usedto decide on the final class to which the object 130 belongs, from amongthe extended class set in extended class setting processing.

In the case of the object 130, there is a characteristic 131 (see FIG.1, etc.) that is valid for discrimination processing of the class.Therefore, an evaluation value is calculated by using a template of thecharacteristic 131 of the object 130 in each class included in theextended class, and performing template matching to the correspondingportion of the input image.

Here, we will let c be the number of classes included in the extendedclass, Tc be the template corresponding to each class, Mc×Nc be the sizeof each template, and Tc (i, j) be the pixel value at a position (i, j)of the template Tc. We will also let I (i, j) be the pixel value for theinput image superposed with the template Tc. In this case, thesimilarity Rc between the template Tc and the input image is calculatedfrom the following Ncc (normalized cross-correlation). Anothersimilarity may be used instead, however.

$\begin{matrix}{R_{C} = \frac{\sum\limits_{j = 0}^{N_{c} - 1}{\sum\limits_{i = 0}^{M_{c} - 1}{{I\left( {i,j} \right)}{T_{c}\left( {i,j} \right)}}}}{\sqrt{\sum\limits_{j = 0}^{N_{c} - 1}{\sum\limits_{i = 0}^{M_{c} - 1}{{I\left( {i,j} \right)}^{2} \times {\sum\limits_{j = 0}^{N_{c} - 1}{\sum\limits_{i = 0}^{M_{c} - 1}{T_{c}\left( {i,j} \right)}^{2}}}}}}}} & \left\lbrack {{Formula}\mspace{14mu} 3} \right\rbrack\end{matrix}$

The search range region W of the template is set on the basis of thecandidate classes output in the candidate class output step (step S301).The position at which the similarity Rc is at its maximum for eachtemplate Tc is detected from within the search range region W, and thissimilarity is termed R _(c). R _(c) is estimated for every classincluded in the extended class, and the evaluation values thereof areadded up. Consequently, the ultimate evaluation value R is as expressedby the following formula.

$\begin{matrix}{R = {\sum\limits_{c}{\overset{\_}{R}}_{c}}} & \left\lbrack {{Formula}\mspace{14mu} 4} \right\rbrack\end{matrix}$

A weighted addition method may also be used, in which a weight ωe isdefined for each evaluation value (Formula 5).

$\begin{matrix}{R = {\sum\limits_{c}{\omega_{c}{\overset{\_}{R}}_{c}}}} & \left\lbrack {{Formula}\mspace{14mu} 5} \right\rbrack\end{matrix}$

R is calculated for every extended class, and the extended class forwhich R is at its maximum is identified. Thus evaluating not just thesimilarity of the templates of candidate classes, but also theevaluation values R to which the similarity of templates of adjacentclasses is added, improves the robustness of discrimination processingby the second discriminator. When an extended class is identified, inthe class discrimination step the corresponding candidate class outputin the candidate class output step (step S301) is decided as the finalclass.

Just as in the candidate class output step (step S301), a random forestmethod or other such classification tree or discriminator may beutilized as the second discriminator. In this case, a classificationtree may be produced using a learning image of the characteristic 131for many different classes, or modified characteristics, as a learningpattern. During discrimination processing, the final class is decided byperforming combination processing such as voting for the classificationresults.

As is clear from the above description, with the information processingapparatus 120 according to this embodiment, in using the first andsecond discriminator to perform discrimination processing, adjacentclasses within the discriminating space are extracted for candidateclasses output by the first discriminator. These candidate classes arecombined with the classes adjacent to these candidate classes to form anextended class, and the second discriminator performs discriminationprocessing on this extended class.

As a result, the robustness of discrimination processing performed bythe second discriminator is better than when discrimination processingis executed by a second discriminator on candidate classes output by afirst discriminator as in the past.

Second Embodiment

In the first embodiment above, in order to improve the robustness ofdiscrimination processing by the second discriminator, the extendedclass is set wider than the candidate classes output by the firstdiscriminator, and the second discriminator executes discriminationprocessing on this extended class.

However, the method for improving the robustness of discriminationprocessing by the second discriminator is not limited to this. Forexample, the configuration may be such that each of the candidateclasses output from the first discriminator is marginalized in thediscriminating space used in discriminating processing by the firstdiscriminator, and the second discriminator compares these marginalizedcandidate classes to decide on the final class. This embodiment will nowbe described in detail.

1. Functional Configuration of Information Processing Apparatus

First, the functional configuration of the information processingapparatus according to this embodiment will be described. FIG. 15 is adiagram illustrating the functional configuration of the informationprocessing apparatus 1500 according to this embodiment. As shown in FIG.15, the basic configuration of the information processing apparatus 1500is substantially the same as that of the information processingapparatus 120 according to the first embodiment described throughreference to FIG. 2, the difference being that a marginalization unit1520 is provided instead of the extended class setting unit 220.

2. Summary of Discrimination Processing by Information ProcessingApparatus

Next, the discrimination processing performed on the object 130 by theinformation processing apparatus 1500 will be described. FIG. 16 is aflowchart showing the flow of discrimination processing performed on theobject 130 by the information processing apparatus 1500.

As shown in FIG. 16, the flow of discrimination processing in theinformation processing apparatus 1500 is substantially the same as thediscrimination processing in the information processing apparatus 120according to the first embodiment described above through reference toFIG. 3. However, there is a difference in the content of the processingin the candidate class output step, and in that a marginalization stepis executed instead of the extended class setting step. The followingdescription will focus on these differences. An example of personalverification through facial recognition is described.

3. Details of Processing Performed by Information Processing Apparatus3.1 Candidate Class Output Processing Performed by Candidate ClassOutput Unit

The extended class output step performed by the candidate class outputunit 210 in step S301 will be described. In the candidate class outputstep, the candidate class output unit 210 causes the first discriminatorheld in the first discriminator holder 250 to execute discriminationprocessing for the input image obtained by capturing an object with theimaging unit 110, thereby acquiring a plurality of candidate classesfrom this first discriminator.

Here, N characteristic points are defined for facial recognition in thediscrimination processing performed by the first discriminator. Forexample, characteristic points expressing the locations of the eyes,nose, mouth, etc., are defined ahead of time. FIG. 17 shows an exampleof characteristic points when the object is a person's face. In FIG. 17,1701 indicates the characteristic points utilized by the firstdiscriminator, such as the eyes, nose, and mouth. 1702 is acharacteristic that is valid for personal verification.

We will let X_(θ) (θ=1, 2, . . . , N) be a probability variable definedby each characteristic F_(θ) (θ=1, 2, . . . , N). Using a person as aclass, we will let Y_(φ) (φ=1, 2, . . . , M) be the probability variabledefined by each person y_(φ) (φ=1, 2, . . . , M).

The simultaneous probability Pr [y_(φ), X₁, X₂, . . . , X_(θ)] of acertain person class y_(φ) (φ=1, 2, . . . , M) estimated from all thecharacteristics is calculated, and the position at which this value isgreater than a specific value is output as a personal discriminationcandidate region.

FIG. 18 shows an example of a candidate class output by executing thecandidate class output step. As shown in FIG. 18, a personaldiscrimination candidate region 1802 is detected and output as acandidate class with respect to an input image 1801 obtained bycapturing with the imaging unit 110.

3.2 Marginalization Processing Performed by the Marginalization Unit

Next, a marginalization step executed in step S1602 by themarginalization unit 1520 will be described. In the marginalization step(S1602), the marginal probability Pr [X_(θ′)] is calculated, rather thancalculating the simultaneous probability Pr [y_(θ), Xe_(θ′),] defined bythe characteristic F_(θ′) that is valid for verifying a person, and thisimproves the robustness of discrimination processing performed by thesecond discriminator.

For example, we will let X and Y be two probability variables, andassume that these respectively correspond to class and characteristicquantity. We will assume that the class X can take any value x_(i) (i=1,2, . . . , M) and the characteristic quantity Y any value y_(j) (j=1, 2,. . . , L). Here, if we let the class be the type of object, and thecharacteristic quantity be the incidence of each dimension of a SHIFTcharacteristic quantity, then when the candidate class output in thecandidate class output step is x_(k) (k=1, 2, . . . , M), the marginalprobability p (Y=y_(k)) related to a specific characteristic quantityy_(k) can be calculated from the following equation. We will assume herethat a plurality of marginalized variables x_(n) have been decided on inrelation to each candidate class.

p(Y=y _(k))=Σp(X=x _(n) ,Y=y _(k))  [Formula 6]

In this embodiment, a characteristic that is valid for verifying acertain person is identified by utilizing the same characteristic datafor a plurality of people to calculate just the existence probability ofthat characteristic.

3.3 Class Discrimination Processing Performed by the Class Identifier

Next, class discrimination processing performed by the classdiscriminator 230 will be described. In class discrimination processing,the region in which the value of the marginal probability Pr [X_(θ′)]calculated in the marginalization step (step S1602) is the largest or isgreater than a specific value out of the personal candidate regionoutput as the candidate class in the candidate class output step (stepS301) is termed the position of a person y_(θ) (θ=1, 2, . . . , M).

As is clear from the above description, in this embodiment, theconfiguration is such that the candidate classes output from the firstdiscriminator are marginalized in the discriminating space used fordiscrimination processing by the first discriminator. Consequently, justas in the first embodiment above, it is possible to improve therobustness of discrimination processing performed by the seconddiscriminator.

Third Embodiment

In the first embodiment above, to improve the robustness ofdiscrimination processing performed by the second discriminator, theconfiguration was such that the extended class was set wider than thecandidate classes output by the first discriminator, and the seconddiscriminator executed discrimination processing on this extended class.

In the second embodiment above, the configuration was such that thecandidate classes output from the first discriminator were marginalizedin the discriminating space used in discrimination processing performedby the first discriminator.

However, the present invention is not limited to this. For example, inusing second discriminator to identify the candidate classes output fromthe first discriminator, the configuration may be such that a pluralityof characteristic points and classes are newly set for each candidateclass, and the discrimination results for the characteristic points ofthis plurality of classes are combined in making a determination. Thisembodiment will now be described in detail.

1. Functional Configuration of Information Processing Apparatus

First, the functional configuration of the information processingapparatus according to this embodiment will be described. FIG. 19 is adiagram illustrating the functional configuration of the informationprocessing apparatus 1900 according to this embodiment. As shown in FIG.19, the basic configuration of the information processing apparatus 1900is substantially the same as that of the information processingapparatus 120 according to the first embodiment described throughreference to FIG. 2, the difference being that a subsequent-stagediscriminator parameter setting unit 1920 is provided instead of theextended class setting unit 220.

2. Summary of Discrimination Processing by Information ProcessingApparatus

Next, the discrimination processing performed on the object 130 by theinformation processing apparatus 1900 will be described. FIG. 20 is aflowchart showing the flow of discrimination processing performed on theobject 130 by the information processing apparatus 1900.

As shown in FIG. 20, the flow of discrimination processing in theinformation processing apparatus 1900 is substantially the same as thediscrimination processing in the information processing apparatus 120according to the first embodiment described above through reference toFIG. 3. However, there is a difference in the content of the processingin the candidate class output step, and in that a subsequent-stagediscriminator parameter setting step is executed instead of the extendedclass setting step. The following description will focus on thesedifferences. A case in which the object 130 shown in FIG. 4 isidentified will be described below.

3. Details of Processing Performed by Information Processing Apparatus3.1 Subsequent-Stage Discriminator Parameter Setting Performed bySubsequent-Stage Discriminator Parameter Setting Unit

The subsequent-stage discriminator parameter setting step executed instep S2002 by the subsequent-stage discriminator parameter setting unit1920 will be described.

In the subsequent-stage discriminator parameter setting step, adictionary or parameters for the second discriminator are set so as toimprove the robustness of discrimination processing by the seconddiscriminator with respect to the candidate classes output in thecandidate class output step S301 (x_(p), y_(p), ID_(p)) (p=1, 2, . . . ,P).

In the case of the object 130 shown in FIG. 4, since there is acharacteristic 131 that is valid for the discrimination of a class, inperforming learning processing with the first discriminator,characteristic points acquired from near the characteristic 131 of thelearning image of each orientation class are recorded. In thesubsequent-stage discriminator parameter setting step (step S2002), theorientation class ID_(p)′ and the characteristic point f_(p)′ voted(combined) in discrimination performed in the class discrimination step(step S303) are set as parameters for every candidate class. Theorientation class ID_(p)′ is set a plurality of times for the ID_(p) ofthe candidate classes, and the discrimination results for thecharacteristic point f_(p)′ of a plurality of classes are combined,which improves the robustness in discrimination processing by the seconddiscriminator.

The description here was of characteristic points, but it may instead bea partial region, a HOG, or another such region characteristic. Also,the discrimination method used by the discriminator may be a randomforest method, template matching, or any other discrimination method.Since the above-mentioned parameters can be set during discriminationprocessing, the first discriminator and second discriminator may be thesame.

Also, the configuration may be such that a dictionary that classifies acharacteristic point f_(p)′ acquired ahead of time and off-line near thecharacteristic 131 and other characteristic points acquired from thelearning image is learned, and is used as a discrimination dictionary inthe class discrimination step (step S303).

3.2 Class Discrimination Processing Performed by the Class Identifier

Next, the class discrimination step executed in step S303 by the classidentifier 230 will be described.

In the class discrimination step (step S303), discrimination processingis performed using a dictionary or parameters of the discriminator setin the subsequent-stage discriminator parameter setting step (stepS2002) for the candidate classes output in the candidate class outputstep (step S301).

As is clear from the above description, in this embodiment, in using thesecond discriminator to identify the candidate classes output from thefirst discriminator, a plurality of characteristic points and classesare newly set for the candidate classes, and a decision is made aftercombining the discrimination results for the characteristic points ofthis plurality of classes.

Consequently, just as in the first embodiment above, the robustness ofdiscrimination processing can be improved.

Other Embodiments

Aspects of the present invention can also be realized by a computer of asystem or apparatus (or devices such as a CPU or MPU) that reads out andexecutes a program recorded on a memory device to perform the functionsof the above-described embodiment(s), and by a method, the steps ofwhich are performed by a computer of a system or apparatus by, forexample, reading out and executing a program recorded on a memory deviceto perform the functions of the above-described embodiment(s). For thispurpose, the program is provided to the computer for example via anetwork or from a recording medium of various types serving as thememory device (e.g., computer-readable medium).

While the present invention has been described with reference toexemplary embodiments, it is to be understood that the invention is notlimited to the disclosed exemplary embodiments. The scope of thefollowing claims is to be accorded the broadest interpretation so as toencompass all such modifications and equivalent structures andfunctions.

This application claims the benefit of Japanese Patent Application No.2011-264117 filed Dec. 1, 2011, which is hereby incorporated byreference herein in its entirety.

What is claimed is:
 1. An information processing method of identifying aclass of an object by using a plurality of discriminators, said methodcomprising: an acquisition step of acquiring as a candidate class aclass discriminated at a first stage of the discriminators; and asetting step of setting in a second stage of the discriminators, a classof the second stage of the discriminators, which is defined as anextended partial space of a partial space defined by a candidate classin a discriminating space used in discriminating the candidate class atthe first stage of the discriminators, as a class to be discriminated atthis second stage of the discriminators.
 2. An information processingmethod of identifying a class of an object by using a plurality ofdiscriminators, said method comprising: an acquisition step of acquiringas a candidate class a class discriminated at a first stage of thediscriminators; and a setting step of setting in a second stage of thediscriminators, a marginal probability of a candidate class of thesecond stage of the discriminators, that is calculated except aprobability variable of a specific characteristic from among probabilityvariables expressing an existence probability of each of a plurality ofcharacteristics defining the candidate classes, as a parameter to beused in the discrimination of this candidate class.
 3. An informationprocessing method of identifying a class of an object by using aplurality of discriminators, said method comprising: an acquisition stepof acquiring as a candidate class a class discriminated at a first stageof the discriminators; and a setting step of setting in a second stageof the discriminators, a plurality of classes that are predefined forevery candidate class, as a class to be used in the discriminating ofthese candidate classes.
 4. The information processing method accordingto claim 1, wherein the class includes a class that identifies theorientation of the object.
 5. An information processing apparatus thatuses a plurality of stages of discriminators to identify a class of anobject, said apparatus comprising: an acquisition unit that acquires asa candidate class a class discriminated at a first stage of thediscriminators; and a setting unit that sets in a second stage of thediscriminators, a class of the second stage of the discriminators, whichis defined as an extended partial space of a partial space defined by acandidate class in a discriminating space used in discriminating thecandidate class at the first stage of the discriminators, as a class tobe discriminated at this second stage of the discriminators.
 6. Aninformation processing apparatus that uses a plurality of stages ofdiscriminators to identify a class of an object, said apparatuscomprising: an acquisition unit that acquires as a candidate class aclass discriminated at a first stage of the discriminators; and asetting unit that sets in a second stage of the discriminators, amarginal probability of a candidate class of the second stage of thediscriminators, that is calculated except a probability variable of aspecific characteristic from among probability variables expressing anexistence probability of each of a plurality of characteristics definingthe candidate classes, as a parameter to be used in the discriminationof this candidate class.
 7. An information processing apparatus thatuses a plurality of stages of discriminators to identify a class of anobject, said apparatus comprising: an acquisition unit that acquires asa candidate class a class discriminated at a first stage of thediscriminators; and a setting unit that sets in a second stage of thediscriminators, a plurality of classes that are predefined for everycandidate class, as a class to be used in the discriminating of thesecandidate classes.
 8. A computer-readable recording medium that stores aprogram for causing a computer to function as the units of theinformation processing apparatus according to claim
 5. 9. Acomputer-readable recording medium that stores a program for causing acomputer to function as the units of the information processingapparatus according to claim
 6. 10. A computer-readable recording mediumthat stores a program for causing a computer to function as the units ofthe information processing apparatus according to claim 7.